Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors
نویسندگان
چکیده
Any natural number can be expressed as an Egyptian fraction, i.e., P 1/ai with a1 < a2 < · · · < a`, where each denominator is the product of three distinct primes.
منابع مشابه
. N T ] 8 A pr 1 99 8 DENSE EGYPTIAN FRACTIONS
Every positive rational number has representations as Egyptian fractions (sums of reciprocals of distinct positive integers) with arbitrarily many terms and with arbitrarily large denominators. However, such representations normally use a very sparse subset of the positive integers up to the largest denominator. We show that for every positive rational there exist representations as Egyptian fr...
متن کاملDenser Egyptian Fractions
An Egyptian fraction is a sum of reciprocals of distinct positive integers, so called because the ancient Egyptians represented rational numbers in that way. In an earlier paper, the author [8] showed that every positive rational number r has Egyptian fraction representations where the number of terms is of the same order of magnitude as the largest denominator. More precisely, there exists a p...
متن کاملOn a Random Search Tree: Asymptotic Enumeration of Vertices by Distance from Leaves
A random binary search tree grown from the uniformly random permutation of [n] is studied. We analyze the exact and asymptotic counts of vertices by rank, the distance from the set of leaves. The asymptotic fraction ck of vertices of a fixed rank k ≥ 0 is shown to decay exponentially with k. Notoriously hard to compute, the exact fractions ck had been determined for k ≤ 3 only. We computed c4 a...
متن کاملPrime Divisors of Sequences Associated to Elliptic Curves
We consider the primes which divide the denominator of the x-coordinate of a sequence of rational points on an elliptic curve. It is expected that for every sufficiently large value of the index, each term should be divisible by a primitive prime divisor, one that has not appeared in any earlier term. Proofs of this are known in only a few cases. Weaker results in the general direction are give...
متن کاملOn Covering Numbers
A positive integer n is called a covering number if there are some distinct divisors n1, . . . , nk of n greater than one and some integers a1, . . . , ak such that Z is the union of the residue classes a1(mod n1), . . . , ak(mod nk). A covering number is said to be primitive if none of its proper divisors is a covering number. In this paper we give some sufficient conditions for n to be a (pri...
متن کامل